On Algorithmic Complexity, Universal Priors and Ockham's Razor

The first part of this paper is a review of basic notions and results connected with Kolmogorov complexity theory

On Bayesian estimation of multinomial probabilities under incomplete experimental information

In this work, we discuss Bayesian estimation of multinomial probabilities associated with a finite alphabet A under incomplete experimental information. Two types of prior information are considered: (i) number of letters needed to see a particular pattern for the first time, and (ii) the fact that for two fixed words one appeared before the other.Patterns, Stopping times, Incomplete experimental information